EGO-Planner: An ESDF-Free Gradient-Based Local Planner for Quadrotors
نویسندگان
چکیده
Gradient-based planners are widely used for quadrotor local planning, in which a Euclidean Signed Distance Field (ESDF) is crucial evaluating gradient magnitude and direction. Nevertheless, computing such field has much redundancy since the trajectory optimization procedure only covers very limited subspace of ESDF updating range. In this letter, an ESDF-free gradient-based planning framework proposed, significantly reduces computation time. The main improvement that collision term penalty function formulated by comparing colliding with collision-free guiding path. resulting obstacle information will be stored if hits new obstacles, making planner extract necessary information. Then, we lengthen time allocation dynamical feasibility violated. An anisotropic curve fitting algorithm introduced to adjust higher order derivatives while maintaining original shape. Benchmark comparisons real-world experiments verify its robustness high-performance. source code released as ros packages.
منابع مشابه
Fast Local Planner for Autonomous Helicopter
One challenge of autonomous flight is creating a system for planning routes and reacting to environments that is fast enough to take full advantage of the high speed of aircraft. This problem of obstacle avoidance is especially relevant when creating a program that lands robotic helicopters in urban environments. Since these areas are highly concentrated with static obstacles like buildings as ...
متن کاملLocal Search Topology: Implications for Planner Performance
Hoffmann’s topological analysis of the h and h F state spaces explained why Fast Forward dominated the performance on early planning domains (Hoffmann 2004). His taxonomy segmented domains according to the presence/size of local minima and dead-end class. Surprisingly, the taxonomy has not been used to explain the performance of other planners that use similar heuristics. In this paper, we exte...
متن کاملEffector-Based Operator Construction: An Alternative Planner Knowledge Representation for Reducing Planner Maintenance Effort
Researchers attempting to deploy complex planners in practical applications have met with the high cost of maintaining and debugging a planner’s knowledge base. There has been some success in using knowledge acquisition tools and machine learning techniques to assist in development of operator schemas. However, it is often hard for the domain experts who are the users of the program to do their...
متن کاملFF + FPG: Guiding a Policy-Gradient Planner
The Factored Policy-Gradient planner (FPG) (Buffet & Aberdeen 2006) was a successful competitor in the probabilistic track of the 2006 International Planning Competition (IPC). FPG is innovative because it scales to large planning domains through the use of Reinforcement Learning. It essentially performs a stochastic local search in policy space. FPG’s weakness is potentially long learning time...
متن کاملAbstracting The Planner Down Down: An Architecture for Planner Based Control of Autonomous Vehicles
ing The Planner Down Down: An Architecture for Planner Based Control of Autonomous Vehicles Nick Johnson and David Lane Ocean Systems Laboratory Heriot-Watt University Edinburgh, UK
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE robotics and automation letters
سال: 2021
ISSN: ['2377-3766']
DOI: https://doi.org/10.1109/lra.2020.3047728